Computation of Continued Fractions Without Input Values
نویسندگان
چکیده
منابع مشابه
Computation of Continued Fractions without Input Values
An algorithm for the computation of the continued fraction expansions of numbers which are zeros of differentiable functions is given. The method is direct in the sense that it requires function evaluations at appropriate steps, rather than the value of the number as input in order to deliver the expansion. Statistical data on the first 10000 partial quotients for various real numbers are also ...
متن کاملProbabilities as Values of Modular Forms and Continued Fractions
Abstract. We consider certain probability problems which are naturally related to integer partitions. We show that the corresponding probabilities are values of classical modular forms. Thanks to this connection, we then show that certain ratios of probabilities are specializations of the Rogers-Ramanujan, and RamanujanSelbergGordon-Göllnitz continued fractions. One particular evaluation depend...
متن کاملModular relations and explicit values of Ramanujan-Selberg continued fractions
By employing a method of parameterizations for Ramanujan's theta-functions, we find several modular relations and explicit values of the Ramanujan-Selberg continued fractions .
متن کاملOn the values of continued fractions: q-series
Using the Poincaré–Perron theorem on the asymptotics of the solutions of linear recurrences it is proved that for a class of q-continued fractions the value of the continued fraction is given by a quotient of the solution and its q-shifted value of the corresponding qfunctional equation. r 2003 Elsevier Inc. All rights reserved.
متن کاملEfficient computation of addition-subtraction chains using generalized continued Fractions
The aim of this paper is to present a new way of computing short addition-subtraction chains using the generalized continued fractions where subtraction is allowed. We will recover the most used ways of getting addition-subtraction chains. This method is not always optimal but gives minimal chains that are easy to compute.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1995
ISSN: 0025-5718
DOI: 10.2307/2153497